Effectiveness of (R,Q) policies in one‐warehouse multiretailer systems with deterministic demand and backlogging

Consider a distribution system with a central warehouse and multiple retailers. Customer demand arrives at each of the retailers continuously at a constant rate. The retailers replenish their inventories from the warehouse which in turn orders from an outside supplier with unlimited stock. There are economies of scale in replenishing the inventories at both the warehouse and the retail level. Stockouts at the retailers are backlogged. The system incurs holding and backorder costs. The objective is to minimize the long‐run average total cost in the system. This paper studies the cost effectiveness of (R, Q) policies in the above system. Under an (R, Q) policy, each facility orders a fixed quantity Q from its supplier every time its inventory position reaches a reorder point R. It is shown that (R, Q) policies are at least 76% effective. Numerical examples are provided to further illustrate the cost effectiveness of (R, Q) policies. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 422–439, 2000     

火力运用对策空间模型

根据空 -地作战的特点 ,提出了软、硬火力单位的概念 ,根据模型提出了作战指数、生存指数 ,为双方的实力与“保卫目标”的安全度分析提供了数量依据 ;根据微分对策和战术原则提出了规范作战模式等概念 ,为构造火力运用、兵力数量需求等算法搭起一个框架。     

Optimal policies for M/M/m queue with two different kinds of (N,T)‐policies

In this paper, two different kinds of (N, T)‐policies for an M/M/m queueing system are studied. The system operates only intermittently and is shut down when no customers are present any more. A fixed setup cost of K > 0 is incurred each time the system is reopened. Also, a holding cost of h > 0 per unit time is incurred for each customer present. The two (N, T)‐policies studied for this queueing system with cost structures are as follows: (1) The system is reactivated as soon as N customers are present or the waiting time of the leading customer reaches a predefined time T, and (2) the system is reactivated as soon as N customers are present or the time units after the end of the last busy period reaches a predefined time T. The equations satisfied by the optimal policy (N*, T*) for minimizing the long‐run average cost per unit time in both cases are obtained. Particularly, we obtain the explicit optimal joint policy (N*, T*) and optimal objective value for the case of a single server, the explicit optimal policy N* and optimal objective value for the case of multiple servers when only predefined customers number N is measured, and the explicit optimal policy T* and optimal objective value for the case of multiple servers when only predefined time units T is measured, respectively. These results partly extend (1) the classic N or T policy to a more practical (N, T)‐policy and (2) the conclusions obtained for single server system to a system consisting of m (m ≥ 1) servers. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 240–258, 2000     

混沌信号处理

描述了混沌特征参量 ,包括Lyapunov指数和分形维 ;讨论了信号相空间重构和Takens嵌入定理 ,以及嵌入维数、时间延迟等参数。还阐述应用神经网络进行混沌信号非线性处理     

飞机飞行控制律多目标优化设计研究

针对传统飞行控制律参数单目标优化设计不能同时满足多控制指标要求,且与飞行品质要求缺乏相关性,物理意义不明确等缺点,提出了一种基于改进NSGA-II算法的飞行控制律多目标优化设计方法。在该算法中提出了一种分化进化策略,使得进化搜索过程中染色体群可以自适应分化为数量和构成动态调整的子群,避免了多染色体子群对局部最优区域的重复搜索,维持染色体的多样性,有效抑制了早熟收敛现象发生。最后,使用改进的NSGA-II算法对某型飞机横航向控制律设计进行数值仿真,结果显示提出算法有效提高控制律优化调参效率,结果满足期望的飞行品质要求。     

大型柔性空间结构的多级分散化振动控制

文中直接以结构的动力学变量作为系统状态,从理论上推导出了反馈和状态变量的解析表达式。基于该表达式,对一空间站模型进行了仿真。结果表明,该方法具有计算量小、稳定性好的优点,便于在线控制。     

Analysis of a finite‐buffer bulk‐service queue with discrete‐Markovian arrival process: D‐MAP/Ga,b/1/N

Discrete‐time queues with D‐MAP arrival process are more useful in modeling and performance analysis of telecommunication networks based on the ATM environment. This paper analyzes a finite‐buffer discrete‐time queue with general bulk‐service rule, wherein the arrival process is D‐MAP and service times are arbitrarily and independently distributed. The distributions of buffer contents at various epochs (departure, random, and prearrival) have been obtained using imbedded Markov chain and supplementary variable methods. Finally, some performance measures such as loss probability and average delay are discussed. Numerical results are also presented in some cases. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 345–363, 2003.     

序列近似优化方法及其在火箭外形快速设计中的应用

针对序列近似优化方法在代理模型构造与采样策略等方面的不足,基于采样点局部密度,引入与局部密度成反比的样本点影响体积概念,通过优化总影响体积确定径向基函数最优核宽度,满足序列近似优化过程不同规模、非均匀样本条件下的函数近似需要;建立潜在可行域最大距离加点准则,并与潜在最优加点准则结合平衡算法的探索能力与开发能力;建立三步收敛判定准则;构建改进序列近似优化的算法流程。对于Golinski减速器的优化设计问题,算法在目标函数调用42次后便搜索到全局最优解,体现了其良好的全局寻优能力与搜索效率。以"天航二号"火箭为例,建立其外形优化问题数学模型,所提优化方法在调用原始计算模型165次之后便搜索到全局最优解,大大提高了设计效率,同时飞行试验也表明设计结果满足要求。     

固定翼反潜巡逻机作战效能评估

运用改进的Topsis评估模型对反潜巡逻机的作战效能进行评估,主要是对指标权重的计算方法进行改进:综合考虑客观熵权和专家主观权重得到综合权重,通过客观的熵权信息来调整主观权重的偏差,使得反潜巡逻机作战效能的评价结果更为合理。实例分析表明,该方法能够主客观相结合,简单有效,具有一定的推广应用价值。